Multiprocessor Scheduling Using Ant Colony Optimization Where Job Values Are the Power Function of Completion Time
نویسندگان
چکیده
This paper deals with an anology of scheduling jobs on prarallel processors using Ant Colony Optimization where job values are given as a power function of the job execution times. We consider a scheduling problem in a machine of parallel processors with the objective of minimization of the total loss of job values is considered as criterion which reflects the minimization of waiting time of the jobs. This paper establishes the computationl complexity of the problem by the application of Ant Colony Optimization on the problem. An augmented experimentation is conducted to evaluate the performance of the parallel processor scheduling using ACO which is strong NP hardness of its general versions and NP hardness of its single machine case. Moreover, some special cases of the problem in the polynomial time.
منابع مشابه
Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning
This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...
متن کاملUsing ant colonies to solve multiprocessor task graph scheduling
The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer. In this paper, we propose an application of the Ant Colony...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملHybrid intelligent algorithm [improved particle swarm optimization (PSO) with ant colony optimization (ACO)] for multiprocessor job scheduling
Efficient multiprocessor scheduling is essentially the problem of allocating a set of computational jobs to a set of processors to minimize the overall execution time. The main issue is how jobs are partitioned in which total finishing time and waiting time is minimized. Minimization of these two criteria simultaneously, is a multi objective optimization problem. There are many variations of th...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کامل